Generalized elastica problems under area constraint
نویسندگان
چکیده
منابع مشابه
Area-constrained planar elastica.
We determine the equilibria of a rigid loop in the plane, subject to the constraints of fixed length and fixed enclosed area. Rigidity is characterized by an energy functional quadratic in the curvature of the loop. We find that the area constraint gives rise to equilibria with remarkable geometrical properties; not only can the Euler-Lagrange equation be integrated to provide a quadrature for ...
متن کامل2 00 6 Generalized Constraint Satisfaction Problems
A number of recent authors have given exponential-time algorithms for optimization problems such as Max Cut and Max Independent Set, or for the more general class of Constraint Satisfaction Problems (CSPs). In this paper, we introduce the class of Generalized Constraint Satisfaction Problems (GCSPs), where the score functions are polynomial-valued rather than real-valued functions. We show that...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملSoft Constraint Logic Programming and Generalized Shortest Path Problems
In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this...
متن کاملBranching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2018
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2018.v25.n2.a9